Static-Priority Scheduling of Sporadic Messages on a Wireless Channel
نویسندگان
چکیده
Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.
منابع مشابه
Global Static-priority Scheduling of Sporadic Task Systems on Multiprocessor Platforms
The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient conditions are derived for determining whether a specified system meets all deadlines when scheduled by a static-priority algorithm. These conditions are used to obtain efficient schedulability tests for sporadic task systems scheduled using the popular Deadline-Monotonic real-time scheduling algorithm. Res...
متن کاملStochastic analysis and performance evaluation of wireless schedulers
In the last few years, wireless scheduling algorithms have been proposed by supplementing wireline scheduling algorithms with a wireless adaptation scheme. However, QoS bounds have either been derived for flows that perceive error-free conditions, or a static worst case channel condition. Such an assumption of the channel condition is unrealistic since channel errors are known to be bursty in n...
متن کاملThe Partitioned, Static-Priority Scheduling of Sporadic Real-Time Tasks with Constrained Deadlines on Multiprocessor Platforms
We consider the partitioned scheduling of sporadic, hard-realtime tasks on a multiprocessor platform with static-priority scheduling policies. Most previous work on the static-priority scheduling of sporadic tasks upon multiprocessors has assumed implicit deadlines (i.e. a task’s relative deadline is equal to its period). We relax the equality constraint on a task’s deadline and consider task s...
متن کاملA Channel Coordination Scheme for High Density Vehicular Ad-Hoc Networks Based on Time Division Multiplexing
IEEE 802.11p Vehicular Ad-Hoc Network (VANET) applies one control channel (CCH) and six service channels (SCHs). CCH is dedicated for broadcasting traffic safety messages, SCHs are dedicated for transmission of varying application messages. In IEEE 802.11p standard, Coordinated Universal Time (UTC) scheme is recommended for coordinating channel access on CCH and multiple SCHs, Enhanced Distribu...
متن کاملPower-aware fixed priority scheduling for sporadic tasks in hard real-time systems
In this paper, we consider the generalized power model in which the focus is the dynamic power and the static power, and we study the problem of the canonical sporadic task scheduling based on the ratemonotonic (RM) scheme. Moreover, we combine with the dynamic voltage scaling (DVS) and dynamic power management (DPM). We present a static low power sporadic tasks scheduling algorithm (SSTLPSA), ...
متن کامل